%0 Conference Proceedings
%4 sid.inpe.br/banon/2004/08.13.18.12
%2 sid.inpe.br/banon/2004/08.13.18.12.18
%@doi 10.1109/SIBGRA.2004.1352967
%T Fast, precise flattening of cubic Bézier segment offset curves
%D 2004
%A Hain, Thomas,
%A Racherla, Sri Venkat,
%A Langan, David,
%@affiliation School of CIS, University of South Alabama, Mobile, AL 36688, USA,
%@affiliation SL Technologies, 711 MLK Jr. Blvd, Biloxi, MS 39530, USA,
%E Araújo, Arnaldo de Albuquerque,
%E Comba, João Luiz Dihl,
%E Navazo, Isabel,
%E Sousa, Antônio Augusto de,
%B Brazilian Symposium on Computer Graphics and Image Processing, 17 (SIBGRAPI) - Ibero-American Symposium on Computer Graphics, 2 (SIACG)
%C Curitiba, PR, Brazil
%8 17-20 Oct. 2004
%I IEEE Computer Society
%J Los Alamitos
%S Proceedings
%K Bezier offset curve, rendering.
%X A fast algorithm for generating a polyline approximation (flattening) for the offset curves of a cubic Bézier curve segment is described. It is shown to be more efficient than the standard recursive subdivision method by generating only 70% as many segments, but, just as importantly, 94% of all segments fall within 20% of the flatness criterion. The code runs as fast as recursive subdivision.
%@language en
%3 BezierOffsetRendering.pdf